package com.wc.AlgoOJ_homework.AlgoOJ_test7.D_计算矩形;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

/**
 * @Author congge
 * @Date 2024/3/25 19:10
 * @description http://43.138.190.70:8888/p/728?tid=65f90350f9a80dc9ddc3f0f3
 */
public class Main {
    static FastReader sc = new FastReader();
    static PrintWriter out = new PrintWriter(System.out);
    static int N = 1010;
    static long[][] s = new long[N][N];
    static int t, n, m, h, w, h1, w1, h2, w2;

    public static void main(String[] args) {
        t = sc.nextInt();
        while (t-- > 0) {
            n = sc.nextInt();
            m = sc.nextInt();
            for (int i = 1; i <= n; i++) {
                h = sc.nextInt();
                w = sc.nextInt();
                s[h][w] += (long) h * w;
            }
            for (int i = 1; i < N; i++) {
                for (int j = 1; j < N; j++) {
                    // 二维前缀和
                    s[i][j] += s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1];
                }
            }

            while (m-- > 0) {
                h1 = sc.nextInt() + 1;
                w1 = sc.nextInt() + 1;
                h2 = sc.nextInt() - 1;
                w2 = sc.nextInt() - 1;
                out.println(s[h2][w2] - s[h2][w1 - 1] - s[h1 - 1][w2] + s[h1 - 1][w1 - 1]);
            }

            for (int i = 1; i < N; i++) {
                Arrays.fill(s[i], 0L);
            }
        }
        out.flush();
    }
}

class FastReader {
    StringTokenizer st;
    BufferedReader br;

    FastReader() {
        br = new BufferedReader(new InputStreamReader(System.in));
    }

    String next() {
        while (st == null || !st.hasMoreElements()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }

    int nextInt() {
        return Integer.parseInt(next());
    }

    String nextLine() {
        String s = "";
        try {
            s = br.readLine();
        } catch (IOException e) {
            e.printStackTrace();
        }
        return s;
    }

    long nextLong() {
        return Long.parseLong(next());
    }

    double nextDouble() {
        return Double.parseDouble(next());
    }

    // 是否由下一个
    boolean hasNext() {
        while (st == null || !st.hasMoreTokens()) {
            try {
                String line = br.readLine();
                if (line == null)
                    return false;
                st = new StringTokenizer(line);
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return true;
    }
}